SelfStabilizing Global Computations with rOperators
نویسندگان
چکیده
This papers describes a parametrized distributed algorithm applicable to any directed graph topology. The function parameter of our algorithm is instantiated to produce distributed algorithms for both fundamental and high level applications, such as shortest path calculus and depth-rst-search tree construction. Due to fault resilience properties of our algorithm, the resulting protocols are self-stabilizing at no additional cost. Self-stabilizing protocols can resist transient failures and guarantee system recovery in a nite time. Since the condition on the function parameter (being a strictly idempotent r-operator) permits a broad range of applications to be implemented, we believe the solution presented in our paper can be quite useful for a large class of distributed systems. Dans cet article, nous d ecrivons un algorithme r eparti et param etr e qui est applicable a tout type de graphe orient e. La fonction param etre de notre algorithme est instanci ee de mani ere a produire plusieurs algorithmes r esolvant a la fois des t^ aches fondamentales et des applications de haut niveau dans le cadre des syst emes r epartis, telles que le calcul des plus courts chemins ou la construction d'un arbre en profondeur. Compte tenu des propri et es de r esistance aux d efaillances de notre algorithme, les protocoles obtenus sont auto-stabilisants sans surco^ ut additionel. Les protocoles auto-stabilisants peuvent r esister a des d efaillances transitoires en garantissant un retour a la normale du syst eme en temps ni. Comme la condition sur la fonction pass ee en param etre de notre algorithme (celle de pouvoir ^ etre r eduite a un r-op erateur strictement idempotent) rend possible le codage d'un vaste champ d'applications r eparties, nous pensons que la solution pr esent ee dans cet article est d'une utilit e certaine pour une large classe de syst emes r epartis.
منابع مشابه
On the Complexity of Adding Convergence
This paper investigates the complexity of designing SelfStabilizing (SS) distributed programs, where an SS program meets two properties, namely closure and convergence. Convergence requires that, from any state, the computations of an SS program reach a set of legitimate states (a.k.a. invariant). Upon reaching a legitimate state, the computations of an SS program remain in the set of legitimat...
متن کاملSelf-stabilizing Leader Election in Networks of Finite-State Anonymous Agents
This paper considers the self-stabilizing leader-election problem in a model of interacting anonymous finite-state agents. Leader election is a fundamental problem in distributed systems; many distributed problems are easily solved with the help of a central coordinator. Selfstabilizing algorithms do not require initialization in order to operate correctly and can recover from transient faults ...
متن کاملStudying Network Optimization in the Context of Self-Stabilization
Self-stabilization is a theoretical framework of nonmasking fault-tolerance for distributed networks. A self-stabilizing system is capable of tolerating any unexpected transient fault without outside intervention and, regardless of the initial state, it can converge to a legitimate global state, a predefined vector of local states, in finite time. Self-stabilization has rendered a good problem ...
متن کاملSelf-stabilizing Cuts in Synchronous Networks
Consider a synchronized distributed system where each node can only observe the state of its neighbors. Such a system is called selfstabilizing if it reaches a stable global state in a finite number of rounds. Allowing two different states for each node induces a cut in the network graph. In each round, every node decides whether it is (locally) satisfied with the current cut. Afterwards all un...
متن کامل